Move-optimal gossiping among mobile agents
نویسندگان
چکیده
منابع مشابه
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may start from arbitrary locations in arbitrary states. Self-stabilization requires (some of the) participating agents to keep moving forever, hinting at maximizi...
متن کاملOptimal gossiping in square 2D meshes
Gossiping is the communication problem in which each node has a unique message to be transmitted to every other node. The nodes exchange their message by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets each carrying exactly one message are used. The nodes of the targe...
متن کاملOptimal Sequential Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of blocks during each call. We study the minimum number of calls necessary to perform gossipi...
متن کاملOn Periodic Gossiping with an Optimal Weight
By the distributed averaging problem is meant the problem of computing the average value ȳ of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each it...
متن کاملOptimal gossiping in paths and cycles
In the gossiping problem each node in a network possesses a token initially after gossiping every node has a copy of every other node s token The nodes exchange their tokens by packets A solution to the problem is judged by how many rounds of packet sending it requires In this paper we consider the version of the problem in which a packet is of limited size a packet can hold up to p tokens the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.11.007